PRISM

Benchmark
Model:csma v.1 (MDP)
Parameter(s)N = 3, K = 2
Property:time_max (exp-reward)
Invocation (default)
../fix-syntax ../prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 csma.3-2.prism csma.props --property time_max
Execution
Walltime:1.2818467617034912s
Return code:0
Relative Error:6.406430404021789e-06
Log
PRISM
=====

Version: 4.5.dev
Date: Sat Apr 03 01:00:40 CEST 2021
Hostname: christopher
Memory limits: cudd=4g, java(heap)=11g
Command line: prism -javamaxmem 11g -cuddmaxmem 4g -heuristic speed -e 1e-6 -maxiters 1000000 csma.3-2.prism csma.props --property time_max

Parsing model file "csma.3-2.prism"...

Type:        MDP
Modules:     bus station1 station2 station3 
Variables:   b y1 y2 s1 x1 bc1 cd1 s2 x2 bc2 cd2 s3 x3 bc3 cd3 

Parsing properties file "csma.props"...

5 properties:
(1) "all_before_max": Pmax=? [ !"collision_max_backoff" U "all_delivered" ]
(2) "all_before_min": Pmin=? [ !"collision_max_backoff" U "all_delivered" ]
(3) "some_before": Pmin=? [ F min_backoff_after_success<K ]
(4) "time_max": R{"time"}max=? [ F "all_delivered" ]
(5) "time_min": R{"time"}min=? [ F "all_delivered" ]

---------------------------------------------------------------------

Model checking: "time_max": R{"time"}max=? [ F "all_delivered" ]

Warning: Switching to sparse engine and (backwards) Gauss Seidel (default for heuristic=speed).

Building model...

Computing reachable states...

Reachability (BFS): 135 iterations in 0.17 seconds (average 0.001296, setup 0.00)

Time for model construction: 0.22 seconds.

Type:        MDP
States:      36850 (1 initial)
Transitions: 55862
Choices:     38456

Transition matrix: 12759 nodes (4 terminal), 55862 minterms, vars: 42r/42c/13nd

Prob0E: 143 iterations in 0.23 seconds (average 0.001622, setup 0.00)

Prob1A: 1 iterations in 0.00 seconds (average 0.002000, setup 0.00)

goal = 7, inf = 0, maybe = 36843

Computing remaining rewards...
Engine: Sparse

Building sparse matrix (transitions)... [n=36850, nc=38449, nnz=55855, k=3] [948.7 KB]
Building sparse matrix (transition rewards)... [n=36850, nc=38449, nnz=25210, k=3] [589.6 KB]
Creating vector for state rewards... [287.9 KB]
Creating vector for inf... [287.9 KB]
Allocating iteration vectors... [2 x 287.9 KB]
TOTAL: [2.6 MB]

Starting iterations...

Iterative method: 250 iterations in 0.12 seconds (average 0.000340, setup 0.04)

Value in the initial state: 105.21067981152419

Time for model checking: 0.366 seconds.

Result: 105.21067981152419 (value in the initial state)


Overall running time: 0.826 seconds.

---------------------------------------------------------------------

Note: There was 1 warning during computation.